Options for tackling the external debt problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولTackling sleeplessness: Psychological treatment options for insomnia
The purpose of the present paper is to review and summarize the research supporting nonpharmacologic treatment options for insomnia. The different treatment approaches are described followed by a review of both original research articles and meta-analyses. Meta-analytic reviews suggest that common nonpharmacologic approaches exert, on average, medium to large effect sizes on SOL, WASO, NWAK, SQ...
متن کاملTackling the Minimal Superpermutation Problem
A superpermutation on n symbols is a string that contains each of the n! permutations of the n symbols as a contiguous substring. The shortest superpermutation on n symbols was conjectured to have length ∑n i=1 i!. The conjecture had been verified for n ≤ 5. We disprove it by exhibiting an explicit counterexample for n = 6. This counterexample was found by encoding the problem as an instance of...
متن کاملOptimal external debt and default
This paper analyses whether sovereign default episodes can be seen as contingencies of optimal international lending contracts. The model considers a small open economy with capital accumulation and without commitment to repay debt. Taking first order approximations of Bellman equations, I derive analytical expressions for the equilibrium level of debt and the optimal debt contract. In this env...
متن کاملTackling Post's Correspondence Problem
Post’s correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solution, and to find the solutions if they exist. In this paper, we describe new application-dependent methods used to efficiently find optimal solutions to individual instances, and to identify instances with no solution. We also prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CEPAL Review
سال: 1989
ISSN: 1684-0348
DOI: 10.18356/bb9bd6e1-en